Automated techniques for higher-order program verification

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated techniques for higher-order program verification

interpretation techniques are used to derive a control-flow analysis for a simple higher-order functional language. The analysis approximates the interprocedural control-flow of both function calls and returns in the presence of first-class functions and tail-call optimization. The analysis is systematically derived by abstract interpretation of the stack-based CaEK abstract machine of Flanagan...

متن کامل

Automated Techniques for Higher-Order Program Verification (NII Shonan Meeting 2011-5)

interpretation techniques are used to derive a control-flow analysis for a simple higher-order functional language. The analysis approximates the interprocedural control-flow of both function calls and returns in the presence of first-class functions and tail-call optimization. The analysis is systematically derived by abstract interpretation of the stack-based CaEK abstract machine of Flanagan...

متن کامل

Higher-Order Program Verification via HFL Model Checking

There are two kinds of higher-order extensions of model checking: HORS model checking and HFL model checking. Whilst the former has been applied to automated verification of higher-order functional programs, applications of the latter have not been well studied. In the present paper, we show that various verification problems for functional programs, including may/must-reachability, trace prope...

متن کامل

Automated Invariant Generation by Algebraic Techniques for Imperative Program Verification in Theorema Automated Invariant Generation by Algebraic Techniques for Imperative Program Verification in Theorema

This thesis presents algebraic and combinatorial approaches for reasoning about imperative loops with assignments, sequencing and conditionals. A certain family of loops, called P-solvable, is defined for which the value of each program variable can be expressed as a polynomial of the initial values of variables, the loop counter, and some new variables where there are algebraic dependencies am...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Progress in Informatics

سال: 2013

ISSN: 1349-8614,1349-8606

DOI: 10.2201/niipi.2013.10.9